Modern Metaheuristic with Multi-Objective Formulation for the Variable Selection Problem
نویسندگان
چکیده
منابع مشابه
Modern Metaheuristic with Multi-Objective Formulation for the Variable Selection Problem
Corresponding Author: Lauro Cassio Martins de Paula Institute of Informatics, Federal University of Goiás, Brazil Email: [email protected] Abstract: The development of efficient algorithms for variable selection becomes important to deal with large and complex datasets. Most works in quantitative chemical analysis have used Genetic Algorithms (GAs) as a reference method to select variabl...
متن کاملThe multi-objective decision making methods based on MULTIMOORA and MOOSRA for the laptop selection problem
A decision making process requires the values of conflicting objectives for alternatives and the selection of the best alternative according to the needs of decision makers. Multi-objective optimization methods may provide solution for this selection. In this paper it is aimed to present the laptop selection problem based on MOORA plus full multiplicative form (MULTIMOORA) and multi-objective o...
متن کاملMulti-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations
This study addresses the resource-constrained project scheduling problem with precedence relations, and aims at minimizing two criteria: the makespan and the total weighted start time of the activities. To solve the problem, five multi-objective metaheuristic algorithms are analyzed, based on Multi-objective GRASP (MOG), Multiobjective Variable Neighborhood Search (MOVNS) and Pareto Iterated Lo...
متن کاملDeveloping a multi objective possibilistic programming model for portfolio selection problem
Portfolio selection problem is one of the most important issues in the area of financial management in which is attempted to allocate wealth to different assets with controlling the return and risk. The aim of this paper is to obtain the optimum portfolio with regard to the cardinality and threshold constraints. In the paper, a novel multi-objective possibilistic programming model is developed ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2017
ISSN: 1549-3636
DOI: 10.3844/jcssp.2017.659.666